A collision window tree algorithm improved by fixed-window and parallel-matching schemes
نویسندگان
چکیده
منابع مشابه
Improved Disparity Estimation by Matching with an Adaptive Window
A novel technique for disparity estimation based on block matching with a local adaptive window is introduced in this paper. In the proposed approach the size and shape of the reference window is calculated adaptively according to the degree of reliability of disparities estimated previously and the local variation of the disparity map. The performance of the method has been verified by compute...
متن کاملThe wide window string matching algorithm
Generally, current string matching algorithms make use of a window whose size is equal to pattern length. In this paper, we present a novel string matching algorithm named WW (for Wide Window) algorithm, which divides the text into n/m overlapping windows of size 2m−1. In the windows, the algorithm attempts m possible occurrence positions in parallel. It firstly searches pattern suffixes from m...
متن کاملWindow-based Stereo Matching Algorithm Using a Weighted Average of Costs Aggregated with Window Size Reduction
In the intensity-based stereo matching algorithm, window-based and coarse-to-fine algorithms are known as typical approaches. The window-based algorithm matches intensity values within windows between two stereo images. The conventional window-based algorithms, however, face a trade-off between error rates of the disparity map in disparity continuity and discontinuity regions due to the window ...
متن کاملAn Improved Query Tree Anti-Collision Algorithm Using Collision Location
In order to reduce the identification delay and the energy consumption of the Query Tree Anti-collision Algorithm, the disadvantage of the current query tree anti-collision algorithms is analyzed and an improved query tree anti-collision algorithm is proposed, which is called collision Location based Hybrid Query Tree (LHQT) algorithm. In the algorithm, Manchester code is used and collision loc...
متن کاملFixed window constant modulus algorithms
W e propose two batch versions of the constant modulus algorithm in which a fixed block of samples is iteratively reused. The convergence rate of the algorithms is shown to be very fast. The delay to which the algorithms converge can be determined i f the peak position of the initialized global channel/equalizer response is known. These fixed window CM algorithms are data eficient, computationa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Technology Letters
سال: 2019
ISSN: 2476-1508
DOI: 10.1002/itl2.108